TRLFS: analysing spectra with an expectation-maximization (EM) algorithm.
نویسندگان
چکیده
A new approach for fitting statistical models to time-resolved laser-induced fluorescence spectroscopy (TRLFS) spectra is presented. Such spectra result from counting emitted photons in defined intervals. Any photon can be described by emission time and wavelength as observable attributes and by component and peak affiliation as hidden ones. Understanding the attribute values of the emitted photons as drawn from a probability density distribution, the model estimation problem can be described as a statistical problem with incomplete data. To solve the maximum likelihood task, an expectation-maximization (EM) algorithm is derived and tested. In contrast to the well known least squares method, the advantage of the new approach is its ability to decompose the spectrum into its components and peaks using the revealed hidden attributes of the photons as well as the ability to decompose a background-superimposed spectrum into the exploitable signal of the fluorescent chemical species and the background. This facilitates new possibilities for evaluation of the resulting model parameters. The simultaneous detection of temporal and spectral model parameters provides a mutually consistent description of TRLFS spectra.
منابع مشابه
An Explanation of the Expectation Maximization Algorithm, Report no. LiTH-ISY-R-2915
The expectation maximization (EM) algorithm computes maximum likelihood estimates of unknown parameters in probabilistic models involving latent variables. More pragmatically speaking, the EM algorithm is an iterative method that alternates between computing a conditional expectation and solving a maximization problem, hence the name expectation maximization. We will in this work derive the EM ...
متن کاملAn Improved EM algorithm
In this paper, we firstly give a brief introduction of expectation maximization (EM) algorithm, and then discuss the initial value sensitivity of expectation maximization algorithm. Subsequently, we give a short proof of EM's convergence. Then, we implement experiments with the expectation maximization algorithm (We implement all the experiments on Gaussion mixture model (GMM) ). Our experiment...
متن کاملOn Regularization Methods of Em-kaczmarz Type
We consider regularization methods of Kaczmarz type in connection with the expectation-maximization (EM) algorithm for solving ill-posed equations. For noisy data, our methods are stabilized extensions of the well established ordered-subsets expectation-maximization iteration (OS-EM). We show monotonicity properties of the methods and present a numerical experiment which indicates that the exte...
متن کاملApproximate Expectation Maximization
We discuss the integration of the expectation-maximization (EM) algorithm for maximum likelihood learning of Bayesian networks with belief propagation algorithms for approximate inference. Specifically we propose to combine the outer-loop step of convergent belief propagation algorithms with the M-step of the EM algorithm. This then yields an approximate EM algorithm that is essentially still d...
متن کاملThe basic idea behind Expectation-Maximization
3 The Expectation-Maximization algorithm 7 3.1 Jointly-non-concave incomplete log-likelihood . . . . . . . . . . . 7 3.2 (Possibly) Concave complete data log-likelihood . . . . . . . . . . 8 3.3 The general EM derivation . . . . . . . . . . . . . . . . . . . . . 10 3.4 The E& M-steps . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.5 The EM algorithm . . . . . . . . . . . . . . . . . . ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Spectrochimica acta. Part A, Molecular and biomolecular spectroscopy
دوره 71 4 شماره
صفحات -
تاریخ انتشار 2008